Another Simple Proof of the Validity of Nagamochi and Ibaraki's Min-cut Algorithm and Queyranne's Extension to Symmetric Submodular Function Minimization
نویسنده
چکیده
M. Stoer and F. Wagner and independently A. Frank have found a simple proof of the validity of Nagamochi and Ibaraki7s min-cut algorithm. This note points out some nice property of the behavior of Nagamochi and Ibaraki's rnin-cut algorithm, which also gives another simple proof of the validity of their algorithm. The proof relies only on the symmetric submodularity of the cut function. Hence, it also gives another simple proof of the validity of Queyranne's extension of Nagamochi and Ibaraki7s algorithm to symmetric submodular function minimization.
منابع مشابه
Some Results about the Contractions and the Pendant Pairs of a Submodular System
Submodularity is an important property of set functions with deep theoretical results and various applications. Submodular systems appear in many applicable area, for example machine learning, economics, computer vision, social science, game theory and combinatorial optimization. Nowadays submodular functions optimization has been attracted by many researchers. Pendant pairs of a symmetric...
متن کاملA Note on Minimizing Submodular Functions
For a given submodular function f on a nite set V , we consider the problem of nding a nonempty and proper subsetX of V that minimizes f(X). If the function f is symmetric, then the problem can be solved by a purely combinatorial algorithm due to Queyranne (1995). This note considers a slightly more general condition than symmetry, i.e., f(X)+f (Y ) f(X Y )+f(Y X) for allX;Y V , and shows that ...
متن کاملAlgorithms for Symmetric Submodular Function Minimization under Hereditary Constraints and Generalizations
We present an efficient algorithm to find nonempty minimizers of a symmetric submodular function f over any family of sets I closed under inclusion. Our algorithm makes O(n3) oracle calls to f and I, where n is the cardinality of the ground set. In contrast, the problem of minimizing a general submodular function under a cardinality constraint is known to be inapproximable within o( √ n/ logn) ...
متن کاملActive-set Methods for Submodular Minimization Problems
We consider the submodular function minimization (SFM) and the quadratic minimization problems regularized by the Lovász extension of the submodular function. These optimization problems are intimately related; for example, min-cut problems and total variation denoising problems, where the cut function is submodular and its Lovász extension is given by the associated total variation. When a qua...
متن کاملA note on the Minimum Norm Point algorithm
We present a provably more efficient implementation of the Minimum Norm Point Algorithm conceived by Fujishige than the one presented in [FUJI06]. The algorithm solves the minimization problem for a class of functions known as submodular. Many important functions, such as minimum cut in the graph, have the so called submodular property [FUJI82]. It is known that the problem can also be efficien...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994